Digraphs with real and gaussian spectra
نویسندگان
چکیده
The conventional binary operations of cartesian product, conjunction, and composition of two digraphs D, and D2 are observed to give the sum, the product, md a more complicated combination of the spectra of D1 and Dz as the resulting spectrum. These formulas for analyzing the spectrum of a digraph are utilized to construct for any positive integer PI, a collection of n nonisomorphic strung reguhw nonsymmetric digraphs with real sptxtra. Fu,rther, an infinite collection of strong nonsymmetric digraphs with nonzero gaussian integer value3 is found. Finally, for any n, it is shown that there are n cospectral strong nonsymmetric digraphs with integral spectra.
منابع مشابه
Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient condi...
متن کاملComputation of Earthquake Response via Fourier Amplitude Spectra
A theoretical relation is presented between the seismological Fourier amplitude spectrumand the mean squared value of the elastic response, which is defined by Gaussian distribution. Byshifting a general process to its mean value, spectrum of the mean squared value of the displacementis computed from the Fourier amplitude spectrum and the real part of the relative displacementtransfer function ...
متن کاملThe Laplacian spectrum of some digraphs obtained from the wheel
The problem of distinguishing, in terms of graph topology, digraphs with real and partially non-real Laplacian spectra is important for applications. Motivated by the question posed in [R. Agaev, P. Chebotarev, Which digraphs with rings structure are essentially cyclic?, Adv. in Appl. Math. 45 (2010), 232–251], in this paper we completely list the Laplacian eigenvalues of some digraphs obtained...
متن کاملMore skew-equienergetic digraphs
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
متن کاملThe Spectra of Manhattan Street Networks
The multidimensional Manhattan street networks constitute a family of digraphs with many interesting properties, such as vertex symmetry (in fact they are Cayley digraphs), easy routing, Hamiltonicity, and modular structure. From the known structural properties of these digraphs, we determine their spectra, which always contain the spectra of hypercubes. In particular, in the standard (two-dime...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 2 شماره
صفحات -
تاریخ انتشار 1980